Quasirandom Load Balancing

Mapping and Load-balancing

Load Balancing Pragmatics

We examine the main practical issues concerning load balancing in distributed systems. Two complementary orientations are examined: an application oriented approach for High Performance Transaction Processing, and a low level process oriented approach.

Scalable Load-Distance Balancing

We introduce the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. We model the service delay experienced by a user as a sum of a network-incurred delay, which depends on its network distance from the server, and a server-incurred delay, stemming from the load on the server. The problem is to minimize the maximum service delay among all...

Load Balancing with Memory

A standard load balancing model considers placing n balls into n bins by choosing d possible locations for each ball independently and uniformly at random and sequentially placing each in the least loaded of its chosen bins. It is well known that allowing just a small amount of choice (d = 2) greatly improves performance over random placement (d = 1). In this paper, we show that similar perform...

Value driven load balancing

To date, the study of dispatching or load balancing in server farms has primarily focused on the minimization ofresponse time. Server farms are typically modeled by a front-end router that employs a dispatching policy to routejobs to one of several servers, with each server scheduling all the jobs in its queue via Processor-Sharing. However,the common assumption has been that al...